Efficient Unobservability against Strong Adversaries
نویسندگان
چکیده
We present Decentralized Unobservable Reporting Protocol (DURP), a low-latency, low-overhead, decentralized protocol for anonymous, unobservable communication to untrusted recipient. DURP ensures unobservability against global eavesdropper (and malicious participants), in contrast to known low-latency protocols such as Tor. DURP design is a modular combination of a simple queuing module, ensuring fixed rates for several events, together with an anonymization module, which can simply use existing anonymous protocols, specifically, either Onion-Routing (DURP) or Crowds (DURP). For length restrictions, we focus on network properties of DURP, e.g., latency. We found, using analysis backed by simulations, that DURP ensures reasonable latency and overhead. Our analysis allows configuring DURP for best trade-off of network properties.
منابع مشابه
Efficient Unobservable Anonymous Reporting against Strong Adversaries
We present DURP, a decentralized protocol for unobservable, anonymous reporting to an untrusted destination, with low latency and overhead. DURP provably ensures strong anonymity properties, as required for some applications (and not provided by existing systems and practical designs, e.g., Tor), specifically: − Provable unobservability against global eavesdropper and malicious participants. − ...
متن کاملDesign of Reliable and Secure Multipliers by Multilinear Arithmetic Codes
We propose an efficient technique for the detection of errors in cryptographic circuits introduced by strong adversaries. Previously a number of linear and nonlinear error detection schemes were proposed. Linear codes provide protection only against primitive adversaries which no longer represents practice. On the other hand nonlinear codes provide protection against strong adversaries, but at ...
متن کاملA Secure and Efficient Certificateless Short Signature Scheme
Certificateless public key cryptography combines advantage of traditional public key cryptography and identity-based public key cryptography as it avoids usage of certificates and resolves the key escrow problem. In 2007, Huang et al. classified adversaries against certificateless signatures according to their attack power into normal, strong and super adversaries (ordered by their attack power...
متن کاملThe Free Haven Project: Distributed Anonymous Storage Service
We present a design for a system of anonymous storage which resists the attempts of powerful adversaries to nd or destroy any stored data. We enumerate distinct notions of anonymity for each party in the system, and suggest a way to classify anonymous systems based on the kinds of anonymity provided. Our design ensures the availability of each document for a publisher-speci ed lifetime. A reput...
متن کاملEncoding Global Unobservability for Efficient Translation to SAT
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservability variables and the logic output values of the blocks with CNF logic variables. Each block’s unobservability variable is restricted by local unobservability constraints, expressing conditions that the output value o...
متن کامل